Performability Analysis: A New Algorithm [Brief Contributions] - Computers, IEEE Transactions on
نویسندگان
چکیده
We propose, ifl this paper, a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the algorithm.
منابع مشابه
Comment on "Performability Analysis: A New Algorithm"
The paper “Performability Analysis: A New Algorithm” describes an algorithm for computing the complementary distribution of the accumulated reward over an interval of time in a homogeneous Markov process. In this comment, we show that in two particular cases, one of which is quite frequent, small modifications of the algorithm may reduce significantly its storage complexity.
متن کاملAvailability Analysis of Repairable Computer Systems and Stationarity Detection
ÐPoint availability and expected interval availability are dependability measures respectively defined by the probability that a system is in operation at a given instant and by the mean percentage of time during which a system is in operation over a finite observation period. We consider a repairable computer system and we assume, as usual, that the system is modeled by a finite Markov process...
متن کاملCorrection to the 2005 , IEEE Transactions on Computers paper : ” Digit Selection for SRT Division and Square Root ”
It has been pointed out by counterexamples in a 2013 paper in the IEEE Transactions on Computers [1], that there is an error in the previously ibid. in 2005 published paper [2] on the construction of valid digit selection tables for SRT type division and square root algorithms. The error has been corrected, and new results found on selection constants for maximally redundant digit sets.
متن کاملState of the Journal
Dimitris Gizopoulos is a professor in the Department of Informatics & Telecommunications, the National and Kapodistrian University of Athens where he leads the Computer Architecture Laboratory. His research focuses on the dependability, performance, and power efficiency of computing systems architectures built around high-performance and embedded multicore CPUs as well as GPUs. He has published...
متن کاملHarvest Rate of Reconfigurable Pipelines [Brief Contributions] - Computers, IEEE Transactions on
For a reconfigurable architecture, the harvest rate is the expected percentage of defect-free processors that can be connected into the desired topology. In this paper, we give an analytical estimation for the harvest rate of reconfigurable multipipelines based on the following model: There are n pipelines each with m stages, where each stage of a pipeline is defective with identical independen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009